Guarding a Convex Target Set From an Attacker in Euclidean Spaces
نویسندگان
چکیده
This letter addresses a two-player target defense game in an $n$ -dimensional Euclidean space where attacker attempts to enter closed convex set whereas defender strives capture the beforehand. We propose generalized differential game-based solution model that can not only encompass recent work associated with similar problems whose sets have simple low-dimensional geometric shapes, but also address involve nontrivial shapes of high-dimensional sets. The has two value functions, each which is derived semi-analytical form including optimization problem admits unique solution. If latter solutions closed-form expressions, barrier surface divides state into winning players be analytically constructed. For case there exists no smooth boundary, map between boundary and projection on derived. By using Hamilton-Jacobi-Isaacs equation, we show our feedback strategies always constitute saddle point game. verify related provide numerical simulation results.
منابع مشابه
Guarding the Convex Subsets of a Point-set
A point in the plane is called a guard for the convex set C if it lies in the interior of C. Let P be a planar point-set. A set S of points is a k-convex guard set for P if every convex k-gon formed from points of P contains a guard from S. We study, for any integer k 3, the minimum size of a k-convex guard set of a given planar point-set of size n. We give the tight bounds for the case k = 3, ...
متن کاملMaximum Margin Classification on Convex Euclidean Metric Spaces
In this paper, we present a new implementable learning algorithm for the general nonlinear binary classification problem. The suggested algorithm abides the maximum margin philosophy, and learns a decision function from the set of all finite linear combinations of continuous differentiable basis functions. This enables the use of a much more flexible function class than the one usually employed...
متن کاملSpatial Analysis in curved spaces with Non-Euclidean Geometry
The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...
متن کاملFrom the Lorentz Transformation Group in Pseudo-Euclidean Spaces to Bi-gyrogroups
The Lorentz transformation of order $(m=1,n)$, $ninNb$, is the well-known Lorentz transformation of special relativity theory. It is a transformation of time-space coordinates of the pseudo-Euclidean space $Rb^{m=1,n}$ of one time dimension and $n$ space dimensions ($n=3$ in physical applications). A Lorentz transformation without rotations is called a {it boost}. Commonly, the ...
متن کاملOn a relative Alexandrov-Fenchel inequality for convex bodies in Euclidean spaces
In this note we prove a localized form of Alexandrov-Fenchel inequality for convex bodies, i.e. we prove a class of isoperimetric inequalities in a ball involving Federer curvature measures. 1991 Mathematics Subject Classification: 52A20, 52A39, 52A40, 49Q15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2022
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2021.3132083